Redexes are stable in the λ-calculus
نویسنده
چکیده
منابع مشابه
Encoding Turing Machines into the Deterministic Lambda-Calculus
1. Weakly strategy independent : the image of the encoding is a very small fragment of the λ-calculus, that we call the deterministic λ-calculus Λdet. Essentially, it is the CPS (continuation-passing style) λ-calculus restricted to weak evaluation (i.e., not under abstractions). In Λdet every term has at most one redex, and so all weak strategies collapse into a single deterministic evaluation ...
متن کاملRepetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
For the λ -calculus with letrec we develop an optimisation, which is based on the contraction of a certain class of ‘future’ (also: virtual) redexes. In the implementation of functional programming languages it is common practice to perform β -reductions at compile time whenever possible in order to produce code that requires fewer reductions at run-time. This is, however, in principle limited ...
متن کاملThe CPS/ANF Saga
The CPS transformation dates back to the early 1970’s, where it arose as a technique to represent the control flow of programs in λ-calculus based programming languages as λ-terms in the full (free β) λ-calculus. Toward the end of that decade and afterward, compiler writers found that terms in continuation passing style represented a good intermediate language between their corresponding direct...
متن کاملProperties of Developments via Simple Types
By using an infinity of extra constants every λ-term with indexed redexes is interpreted into a term in the simply typed λ-calculus à la Curry. A development becomes a usual β-reduction in the simply typed lambda calculus and the corresponding properties of developments come out from the corresponding properties (strong normalization and Church-Rosser) holding in this system. In this way we obt...
متن کاملAn Operational Account of Call-By-Value Minimal and Classical -calculus in ''Natural Deduction'' Form
We give a decomposition of the equational theory of call-byvalue λ-calculus into a confluent rewrite system made of three independent subsystems that refines Moggi’s computational calculus: – the purely operational system essentially contains Plotkin’s βv rule and is necessary and sufficient for the evaluation of closed terms; – the structural system contains commutation rules that are necessar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 27 شماره
صفحات -
تاریخ انتشار 2017